Covering a Graph with Cycles of Length at Least 4
نویسندگان
چکیده
منابع مشابه
Length of Longest Cycles in a Graph Whose Relative Length is at Least Two
Let G be a graph. We denote p(G) and c(G) the order of a longest path and the order of a longest cycle of G, respectively. Let κ(G) be the connectivity of G, and let σ3(G) be the minimum degree sum of an independent set of three vertices in G. In this paper, we prove that if G is a 2-connected graph with p(G) − c(G) ≥ 2, then either (i) c(G) ≥ σ3(G) − 3 or (ii) κ(G) = 2 and p(G) ≥ σ3(G)− 1. Thi...
متن کاملCovering the vertices of a graph with cycles of bounded length
Let ck(G) be the minimum number of elementary cycles of length at most k necessary to cover the vertices of a given graph G. In this work, we bound ck(G) by a function of the order of G and its independence number. © 2008 Elsevier B.V. All rights reserved.
متن کاملCovering a bipartite graph with cycles passing through given edges
We propose a conjecture: for each integer k 2:: 2, there exists N (k) such that if G = (Vb \12; E) is a bipartite graph with IV11 = 1\121 = n 2: N(k) and d( x) + d(y) 2: n + k for each pair of non-adjacent vertices x and y of G with x E V1 and y E \12, then for any k independent edges el, ... , ek of G, there exist k vertex-disjoint cycles G1, ... , Gk in G such that ei E E(Gi ) for all i E {I,...
متن کاملA 4-dimensional graph has at least 9 edges
The open problem posed by Paul Erd®s asking for the smallest number of edges in a 4-dimensional graph is solved by showing that a 4-dimensional graph must have at least 9 edges. Furthermore, there is only one 4-dimensional graph with 9 edges, namely K 3,3 .
متن کاملCovering vertices of a graph by k disjoint cycles
Let d; k and n be three integers with k¿ 3; d¿ 4k − 1 and n¿ 3k. We show that if d(x) + d(y)¿d for each pair of nonadjacent vertices x and y of a graph G of order n, then G contains k vertex-disjoint cycles converting at least min{d; n} vertices of G. c © 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/4099